package javaBase.nowcoder.HJ108_A_求最小公倍数;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class HJ108 {
    public static void main(String[] args) throws IOException {
        String[] nums;
        try (BufferedReader br = new BufferedReader(new InputStreamReader(System.in))) {
            nums = br.readLine().split(" ");
        }
        Integer numA = Integer.parseInt(nums[0]);
        Integer numB = Integer.parseInt(nums[1]);

        if (numA % numB == 0) {
            System.out.println(numA);
        } else if (numB % numA == 0) {
            System.out.println(numB);
        } else {
            int mul = 1;
            for (int i = 1; i <= (numA < numB ? numA : numB); i++) {
                while (numA % i == 0 && numB % i == 0) {
                    mul *= i;
                    numA /= i;
                    numB /= i;
                    i++;

                }
            }
            mul *= numA * numB;
            System.out.println(mul);

        }

    }
}

